Method for Analysing Requirement Change Propagation based on a Modified Pagerank Algorithm
نویسندگان
چکیده
منابع مشابه
Clustering Large-Scale Data Based On Modified Affinity Propagation Algorithm
Traditional clustering algorithms are no longer suitable for use in data mining applications that make use of large-scale data. There have been many large-scale data clustering algorithms proposed in recent years, but most of them do not achieve clustering with high quality. Despite that Affinity Propagation (AP) is effective and accurate in normal data clustering, but it is not effective for l...
متن کاملA Modified Apriori Algorithm for Analysing High-Dimensional Gene Data
Modern high-throughput technologies allow the systematic characterisation of an organism but provide excessive amounts of data such as results from microarray gene expression experiments. Combining the information from various experiments will help to expand the knowledge about an organism. However, the analysis of a data set comprising measurements for thousands of genes under many conditions,...
متن کاملA modified LLL algorithm for change of ordering of Grobner basis
In this paper, a modied version of LLL algorithm, which is a an algorithm with output-sensitivecomplexity, is presented to convert a given Grobner basis with respect to a specic order of a polynomialideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order.Also a comparison with the FGLM conversion and Buchberger method is considered.
متن کاملAn advanced pre-positioning method for the force-directed graph visualization based on pagerank algorithm
Graph visualization techniques aim to help users obtain deep insights about the structure and evolution of graphs through minimizing visual confusion and real-time updating of the drawing. This demands high effectiveness of the drawing algorithms to produce layout of graphs with few edge crossings. However, the classical force-directed algorithms fail to satisfy this requirement. In this paper,...
متن کاملA PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations
We address the PageRank problem of associating a relative importance value to all web pages in the Internet so that a search engine can use them to sort which pages to show to the user. This precludes finding the eigenvector associated with a particular eigenvalue of the link matrix constructed from the topology graph of the web. In this paper, we investigate the potential benefits of addressin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Design Society: International Conference on Engineering Design
سال: 2019
ISSN: 2220-4342
DOI: 10.1017/dsi.2019.375